翻訳と辞書 |
Reeb graph
A Reeb graph (named after Georges Reeb) is a mathematical object reflecting the evolution of the level sets of a real-valued function on a manifold.〔Harish Doraiswamy , Vijay Natarajanb, (Efficient algorithms for computing Reeb graphs ), Computational Geometry 42 (2009) 606–616〕 Originally introduced as a tool in Morse theory,〔G. Reeb, Sur les points singuliers d’une forme de Pfaff complètement intégrable ou d’une fonction numérique, C. R. Acad. Sci. Paris 222 (1946) 847–849〕 Reeb graphs found a wide variety of applications in computational geometry and computer graphics, including computer aided geometric design, topology-based shape matching, topological simplification and cleaning, surface segmentation and parametrization, and efficient computation of level sets. In a special case of a function on a flat space, the Reeb graph forms a polytree and is also called a contour tree.〔.〕 == Formal definition ==
Given a topological space ''X'' and a continuous function ''f'': ''X'' → R, define an equivalence relation ∼ on ''X'' where ''p''∼''q'' whenever ''p'' and ''q'' belong to the same connected component of a single level set ''f''−1(''c'') for some real ''c''. The Reeb graph is the quotient space ''X'' /∼ endowed with the quotient topology.
抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Reeb graph」の詳細全文を読む
スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|